A Nonblocking Atomic Transaction Processing Algorithm with Real-Time Property

نویسندگان

  • I-Ling Yen
  • Lirong Dai
  • Ing-Ray Chen
  • Biao Chen
چکیده

Many multiple server systems are now being used for heavily accessed web services. Performance, availability, and real-time transaction processing are important requirements for many of these applications. In this paper, we apply the multi-invariant data structure (MIDS) concept to develop an atomic transaction processing algorithm. We show that our algorithm achieves nonblocking property. It also allows preemption at any point of transaction processing without su ering from inconsistency problems or high recovery costs. Thus, the algorithm is suitable for real-time transaction processing systems. Preliminary performance study results show that our algorithm incurs almost no overhead compared with two phase commit protocol.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transaction Safe Nonblocking Data Structures

This brief announcement focuses on interoperability of software transactions with ad hoc nonblocking algorithms. Specifically, we modify arbitrary nonblocking operations so that (1) they can be used both inside and outside transactions, (2) external uses serialize with transactions, and (3) internal uses succeed if and only if the surrounding transaction commits. Interoperability enables seemle...

متن کامل

Analysis of Optimistic Concurrency Control Revisited

Ryu and Thomasian have analyzed several varieties of optimistic concurrency control under two assumptions: that the characteristics of a transaction remain constant throughout its execution, and that the proportion of committing transactions is xed (in order to avoid an unrealistic biasing of the transaction mixture). We show how both of these assumptions can be relaxed. First, we allow an abor...

متن کامل

Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory

Most multiprocessors are multiprogrammed to achieve acceptable response time and to increase their utilization. Unfortunately, inopportune preemption may significantly degrade the performance of synchronized parallel applications. To address this problem, researchers have developed two principal strategies for a concurrent, atomic update of shared data structures: (1) preemption-safe locking an...

متن کامل

Fault-Tolerant Distributed Systems: a Modular Approach to the Non-Blocking Atomic Commitment Problem

Agreement problems allow a set of processes to agree on a common output value. These problems are of primary importance in distributed systems and di cult to solve in presence of failures. This paper considers one of these problems whose practical interest is well known, namely the NonBlocking Atomic Commitment Problem. First, a generic protocol solving this problem is given and then instantiat...

متن کامل

Language-level Transactions for Modular Reliable Systems

The transaction model is a natural means to express atomicity, fault-tolerance, synchronization, and exception handling in reliable programs. A (lightweight, in-memory) transaction can be thought of as a sequence of program loads and stores which either commits or aborts. If a transaction commits, then all of the loads and stores appear to have run atomically with respect to other transactions....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000